A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

卫星振动对星间光码分多址系统性能的影响

卫星振动是影响星间光CDMA通信系统性能的一个重要因素.考虑多用户干扰、背景光噪音、热噪音、接收机噪音和卫星振动,给出了基于PPM信号格式的星间二维光CDMA通信系统的系统模型.采用数值分析的方法,详细分析了卫星振动对该系统误码率性能的影响.结果表明,码速率、通信波长和卫星振动都会影响星间二维光CDMA通信系统的误码率性能.当卫星振动标准偏差σ≤4×10－7时,卫星振动对系统误码率性能的影响较小；当卫星振动标准偏差σ≥1.2×10－6,卫星振动对系统误码率性能的影响很大,得到的误码率难以满足系统的通信要求,需要采用卫星振动抑制或补偿等技术提高星间二维光CDMA通信系统的误码率性能.     

一类小缺陷码的链条件

利用射影几何方法在小缺陷码中,NMDS码是链条件码;给出k维NμMDS(0μk-2)码满足链条件的一个充要条件与一些易判断的充分条件.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.